منابع مشابه
Bisimulation for Neighbourhood Structures
Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. In coalgebraic terms, a neighbourhood frame is a coalgebra for the contravariant powerset functor composed with itself, denoted by 2. In our paper, we investigate the coalgebraic equivalence notions of 2-bisimulation, behavioural equivalence and neighbourhood bisimulation (a notion based on pus...
متن کاملNeighbourhood Structures: Bisimilarity and Basic Model Theory
Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the contravariant powerset functor composed with itself, denoted by 2. We use this coalgebraic modelling to derive notions of equivalence between neighbourhood s...
متن کاملNeighbourhood Structures: Bisimilarity and Basic Model Theory
Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the contravariant powerset functor composed with itself, denoted by 2 2. We use this coalgebraic modelling to derive notions of equivalence between neighbourhood...
متن کاملTree structures, Entropy, and Action Principles for Neighbourhood Topologies
We recast the idea of decision trees as they emerge in Information theory and Complexity theory into a set theoretical language; the result we call tree structures over a given set. We identify all main structural elements of tree structures, the most important of which is the tree function, defined as a sum over certain quantities at every nod in the tree. We show in detail that the minimizati...
متن کاملOptimised Predecessor Data Structures for Internal Memory
We demonstrate the importance of reducing misses in the translation-lookaside bu er (TLB) for obtaining good performance on modern computer architectures. We focus on data structures for the dynamic predecessor problem: to maintain a set S of keys from a totally ordered universe under insertions, deletions and predecessor queries. We give two general techniques for simultaneously reducing cache...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra universalis
سال: 2020
ISSN: 0002-5240,1420-8911
DOI: 10.1007/s00012-020-0640-2